Sequential and Parallel Abstract Machines for Optimal Reduction
نویسندگان
چکیده
In this paper, we explore a new approach to abstract machines and optimal reduction through streams, ubiquitary objects in mathematics and computer science. We first define a sequential abstract machine capable of performing directed virtual reduction (DVR) and then we extend it to its parallel version, whose equivalence is explained through the properties of DVR itself. The result is a formal definition of PELCR, a software for λ-calculus reductions based on the Geometry of Interaction. In particular, we describe PELCR as a stream-processing abstract machine, which in principle can also be applied to infinite streams.
منابع مشابه
Flexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملParallel Functional Implementations: Graphbased vs. Stackbased Reduction
The meshed stack is a technique for the management of control structures in distributed implementations of dynamic process systems. In the environment of a parallel abstract machine for the execution of functional programs, we compare this approach to the classical graphbased reduction technique. Experimental results will show, that the stackbased reduction is more eecient in space and time, es...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کاملA Sound and Complete SOS-Semantics for Non-Distributed Deterministic Abstract State Machines
In this paper we present a sound and complete Structural Operational Semantics (SOS) for non-distributed deterministic Abstract State Machines (ASMs). Since ASMs exhibit both sequential and parallel features, the semantics is structured into two layers. One layer describes the parallel execution of updates, the other layer describes the sequential execution of rules. The semantics has some nice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014